/**
 * @author YiJia
 */
import java.util.Scanner;

public class weight {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // 读入砝码数量
        int n = scanner.nextInt();

        // 读入砝码重量
        int[] weights = new int[n];
        for (int i = 0; i < n; i++) {
            weights[i] = scanner.nextInt();
        }

        // 判断是否存在一种方案，使得天平平衡
        if (canBalance(weights)) {
            System.out.println("Of course,I can!");
        } else {
            System.out.println("Sorry,I can't!");
        }
    }

    // 判断是否存在一种方案，使得天平平衡
    private static boolean canBalance(int[] weights) {
        int sum = 0;
        for (int weight : weights) {
            sum += weight;
        }

        // 如果所有砝码重量的和是奇数，无法平衡
        if (sum % 2 == 1) {
            return false;
        }

        // 尝试找到一组砝码重量的和等于总重量的一半
        return dfs(weights, 0, 0, sum / 2);
    }

    // 深度优先搜索，尝试找到一组砝码重量的和等于 target
    private static boolean dfs(int[] weights, int index, int sum, int target) {
        if (sum == target) {
            return true;
        }

        if (sum > target || index >= weights.length) {
            return false;
        }

        // 选择当前砝码
        if (dfs(weights, index + 1, sum + weights[index], target)) {
            return true;
        }

        // 不选择当前砝码
        if (dfs(weights, index + 1, sum, target)) {
            return true;
        }

        return false;
    }
}
